Andrews-Curtis and Todd-Coxeter proof words
نویسندگان
چکیده
Andrews and Curtis have conjectured that every balanced presentation of the trivial group can be transformed into a standard presentation by a finite sequence of elementary transformations. It can be difficult to determine whether or not the conjecture holds for a particular presentation. We show that the utility PEACE, which produces proofs based on Todd-Coxeter coset enumeration, can produce Andrews-Curtis proofs.
منابع مشابه
On Rourke’s Extension of Group Presentations and a Cyclic Version of the Andrews–curtis Conjecture
In 1979, Rourke proposed to extend the set of cyclically reduced defining words of a group presentation P by using operations of cyclic permutation, inversion and taking double products. He proved that iterations of these operations yield all cyclically reduced words of the normal closure of defining words of P if the group, defined by the presentation P, is trivial. We generalize this result b...
متن کاملFunctions on Groups and Computational Complexity
We give some connections between various functions defined on finitely presented groups (isoperimetric, isodiametric, Todd-Coxeter radius, filling length functions, etc.), and we study the relation between those functions and the computational complexity of the word problem (deterministic time, nondeterministic time, symmetric space). We show that the isoperimetric function can always be linear...
متن کاملCoset enumeration of groups generated by symmetric sets of involutions
The well-known Todd-Coxeter algorithm [14], which may be viewed as a means of constructing permutation representations of finitely presented groups, remains a primary reference for coset enumeration programs. All the strategies and variants of this algorithm perform essentially the same calculations as the original algorithm, merely choosing different orders in which to process the available in...
متن کاملWords with Intervening Neighbours in Infinite Coxeter Groups are Reduced
Consider a graph with vertex set S. A word in the alphabet S has the intervening neighbours property if any two occurrences of the same letter are separated by all its graph neighbours. For a Coxeter graph, words represent group elements. Speyer recently proved that words with the intervening neighbours property are irreducible if the group is infinite and irreducible. We present a new and shor...
متن کاملThe ternary Golay code, the integers mod 9, and the Coxeter-Todd lattice
The 12-dimensional Coxeter-Todd lattice can be obtained by lifting the ternary Golay code to a code over the integers mod 9 and applying Construction A. Several recent papers have pointed out connections between codes over & and lattices [l], [3]. It is the a m of this correspondence to show that the Coxeter-Todd lattice K12 ([4], [5, ch. 4, sec. 91) can be obtained in a similar way from a code...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001